#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],cnt[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    for(LL i=0;i<=n+10;i++) cnt[i]=0,a[i]=0;
    for(LL i=1;i<=n;i++){
        LL x;cin>>x;
        if(x==0) continue;
        cnt[max((LL)0,i-(x-1))]++;
        cnt[i+1]--;
    }
    for(LL i=1;i<=n;i++){
        cnt[i]+=cnt[i-1];
    }
    for(LL i=1;i<=n;i++){
        if(cnt[i]>0) cout<<"1"<<" ";
        else cout<<"0"<<" ";
    }
    cout<<"\n";
  }
return 0;
}
